Optimal-order quadratic interpolation in vertices of unstructured triangulations
نویسندگان
چکیده
منابع مشابه
Optimal Quasi-Interpolation by Quadratic C-Splines on Type-2 Triangulations
We describe a new scheme based on quadratic C-splines on type-2 triangulations approximating gridded data. The quasiinterpolating splines are directly determined by setting the BernsteinBézier coefficients of the splines to appropriate combinations of the given data values. In this way, each polynomial piece of the approximating spline is immediately available from local portions of the data, w...
متن کاملOptimal Higher Order Delaunay Triangulations of Polygons
This paper presents an algorithm to triangulate polygons optimally using order-k Delaunay triangulations, for a number of quality measures. The algorithm uses properties of higher order Delaunay triangulations to improve the O(n) running time required for normal triangulations to O(kn log k + kn log n) expected time, where n is the number of vertices of the polygon. An extension to polygons wit...
متن کاملReduced-order optimal interpolation for biomass assimilation
The analysis of the evolution of the chemical and biological characteristics of the Mediterranean marine ecosystem requires an integrated approach. Consistently, an ecosystem description, embedded in the MFSTEP one eighth degree threedimensional general circulation model, is tested and used following a twin experiment 5 approach. The ecosystem model is based on the NPZD trophic chain: inorganic...
متن کاملInterpolation by Splines on Triangulations
We review recently developed methods of constructing Lagrange and Her-mite interpolation sets for bivariate splines on triangulations of general type. Approximation order and numerical performance of our methods are also discussed.
متن کاملMatching Extension Missing Vertices and Edges in Triangulations of Surfaces
Let G be a 5-connected triangulation of a surface Σ different from the sphere, and let χ = χ(Σ) be the Euler characteristic of Σ. Suppose that V0 ⊆ V (G) with |V (G) − V0| even and M and N are two matchings in G − V0 of sizes m and n respectively such that M ∩ N = ∅. It is shown that if the pairwise distance between any two elements of V0 ∪ M ∪ N is at least 5 and the face-width of the embeddin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 2008
ISSN: 0862-7940,1572-9109
DOI: 10.1007/s10492-008-0041-x